Multi-warehouse, multi-product inventory control model for agri-fresh products – A case study

- Paam, Parichehr, Berretta, Regina, García-Flores, Rodolfo, Paul, Sanjoy Kumar

Combinatorial optimization methods for the (alpha,beta)-k Feature Set Problem

- Salehipour, Amir

Maintenance scheduling in a railway corridor

- Eskandarzadeh, Saman, Kalinowski, Thomas, Waterer, Hamish

Reconfiguration of distribution system using a binary programming model

- Hyder, Md Mashud, Mahata, Kaushik

A decision support tool for generating shipping data for the Hunter Valley coal chain

- Boland, Natashia, Savelsbergh, Martin, Waterer, Hamish

A trust region method for the solution of the surrogate dual in integer programming

- Boland, N., Eberhard, A. C., Tsoukalas, A.

Integer programming methods for large-scale practical classroom assignment problems

- Phillips, Antony E., Waterer, Hamish, Ehrgott, Matthias, Ryan, David M.

On the augmented Lagrangian dual for integer programming

- Boland, N. L., Eberhard, A. C.

Optimising throughput in the Hunter Valley coal chain using integer programming techniques

- Reisi Ardali, Mohsen

Incremental network design with shortest paths

- Baxter, Matthew, Elgindy, Tarek, Ernst, Andreas T., Kalinowski, Thomas, Savelsbergh, Martin W. P.

A branch-and-price guided search approach to maritime inventory routing

- Hewitt, Mike, Nemhauser, George, Savelsbergh, Martin, Song, Jin-Hwa

A pickup and delivery problem using crossdocks and truckload lane rates

- Lindsey, Kathleen A., Erera, Alan L., Savelsbergh, Martin W. P.

Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem

- Hewitt, Mike, Nemhauser, George, Savelsbergh, Martin W. P.

Creating schedules and computing costs for LTL load plans

- Erera, Alan L., Hewitt, Michael, Savelsbergh, Martin W. P., Zhang, Yang

Creating schedules and computing operating costs for LTL load plans

- Erera, Alan L., Hewitt, Michael, Savelsbergh, Martin W. P., Zhang, Yang

Time aggregation for network design to meet time-constrained demand

- Boland, N., Ernst, A., Kalinowski, T., Rocha de Paula, M., Savelsbergh, M., Singh, G.

A branch-price-and-cut algorithm for single-product maritime inventory routing

- Engineer, Faramroze G., Furman, Kevin C., Nemhauser, George L., Savelsbergh, Martin W. P., Song, Jin-Hwa

A new approach to the feasibility pump in mixed integer programming

- Boland, Natashia, Eberhard, A.C., Engineer, F., Tsoukalas, A.

A stockyard planning problem

- Boland, Natashia, Gulczynski, Damon, Savelsbergh, Martin

Clique-based facets for the precedence constrained knapsack problem

- Boland, Natashia, Bley, Andreas, Fricke, Christopher, Froyland, Gary, Sotirov, Renata